34 research outputs found
Finding Answers from the Word of God: Domain Adaptation for Neural Networks in Biblical Question Answering
Question answering (QA) has significantly benefitted from deep learning
techniques in recent years. However, domain-specific QA remains a challenge due
to the significant amount of data required to train a neural network. This
paper studies the answer sentence selection task in the Bible domain and answer
questions by selecting relevant verses from the Bible. For this purpose, we
create a new dataset BibleQA based on bible trivia questions and propose three
neural network models for our task. We pre-train our models on a large-scale QA
dataset, SQuAD, and investigate the effect of transferring weights on model
accuracy. Furthermore, we also measure the model accuracies with different
answer context lengths and different Bible translations. We affirm that
transfer learning has a noticeable improvement in the model accuracy. We
achieve relatively good results with shorter context lengths, whereas longer
context lengths decreased model accuracy. We also find that using a more modern
Bible translation in the dataset has a positive effect on the task.Comment: The paper has been accepted at IJCNN 201
Infinite and Bi-infinite Words with Decidable Monadic Theories
We study word structures of the form where is either
or , is the natural linear ordering on and
is a predicate on . In particular we show:
(a) The set of recursive -words with decidable monadic second order
theories is -complete.
(b) Known characterisations of the -words with decidable monadic
second order theories are transfered to the corresponding question for
bi-infinite words.
(c) We show that such "tame" predicates exist in every Turing degree.
(d) We determine, for , the number of predicates
such that and
are indistinguishable.
Through these results we demonstrate similarities and differences between
logical properties of infinite and bi-infinite words
Infinite and bi-infinite words with decidable monadic theories
We study word structures of the form (D,<,P) where D is either the naturals or the integers with the natural linear order < and P is a predicate on D. In particular we show: The set of recursive infinite words with decidable monadic second order theories is Sigma_3-complete. We characterise those sets P of integers that yield bi-infinite words with decidable monadic second order theories. We show that such "tame" predicates P exist in every Turing degree. We determine, for a set of integers P, the number of indistinguishable biinfinite words. Through these results we demonstrate similarities and differences between logical properties of infinite and bi-infinite words
Multi-unit Auction over a Social Network
Diffusion auction is an emerging business model where a seller aims to
incentivise buyers in a social network to diffuse the auction information
thereby attracting potential buyers. We focus on designing mechanisms for
multi-unit diffusion auctions. Despite numerous attempts at this problem,
existing mechanisms either fail to be incentive compatible (IC) or achieve only
an unsatisfactory level of social welfare (SW). Here, we propose a novel graph
exploration technique to realise multi-item diffusion auction. This technique
ensures that potential competition among buyers stay ``localised'' so as to
facilitate truthful bidding. Using this technique, we design multi-unit
diffusion auction mechanisms MUDAN and MUDAN-. Both mechanisms satisfy,
among other properties, IC and -weak efficiency. We also show that they
achieve optimal social welfare for the class of rewardless diffusion auctions.
While MUDAN addresses the bottleneck case when each buyer demands only a single
item, MUDAN- handles the more general, multi-demand setting. We further
demonstrate that these mechanisms achieve near-optimal social welfare through
experiments
Differentially Private Diffusion Auction: The Single-unit Case
Diffusion auction refers to an emerging paradigm of online marketplace where
an auctioneer utilises a social network to attract potential buyers. Diffusion
auction poses significant privacy risks. From the auction outcome, it is
possible to infer hidden, and potentially sensitive, preferences of buyers. To
mitigate such risks, we initiate the study of differential privacy (DP) in
diffusion auction mechanisms. DP is a well-established notion of privacy that
protects a system against inference attacks. Achieving DP in diffusion auctions
is non-trivial as the well-designed auction rules are required to incentivise
the buyers to truthfully report their neighbourhood. We study the single-unit
case and design two differentially private diffusion mechanisms (DPDMs):
recursive DPDM and layered DPDM. We prove that these mechanisms guarantee
differential privacy, incentive compatibility and individual rationality for
both valuations and neighbourhood. We then empirically compare their
performance on real and synthetic datasets
Tree-Automatic Well-Founded Trees
We investigate tree-automatic well-founded trees. Using Delhomme's
decomposition technique for tree-automatic structures, we show that the
(ordinal) rank of a tree-automatic well-founded tree is strictly below
omega^omega. Moreover, we make a step towards proving that the ranks of
tree-automatic well-founded partial orders are bounded by omega^omega^omega: we
prove this bound for what we call upwards linear partial orders. As an
application of our result, we show that the isomorphism problem for
tree-automatic well-founded trees is complete for level Delta^0_{omega^omega}
of the hyperarithmetical hierarchy with respect to Turing-reductions.Comment: Will appear in Logical Methods of Computer Scienc